Tree-connected Peer Group Situations and Peer Group Games

A class of cooperative games is introduced which arises from situations in which a set of agents is hierarchically structured and where potential individual economic abilities interfere with the behavioristic rules induced by the organization structure.These games form a cone generated by a specific class of unanimity games, namely those based on coalitions called peer groups. Different economic situations like auctions, communication situations, sequencing situations and flow situations are related to peer group games.For peer group games classical solution concepts have nice properties.auctions;cooperative games;peer groups

Two Classes of Cooperative Games Related to One-Object Auction Situations

AMS classifications; 91A12; 90B05;market games;ring games;one-object auction situations;big boss games;peer group games

Two Approaches to the Problem of Sharing Delay Costs in Joint Projects

AMS classifications: 90D12; 90B35activity graph;bankruptcy problem;taxation problem;serial cost sharing method;delay cost

Convex Games with Countable Number of Players and Sequencing Situations

AMS classification: 91A12;Cooperative games;countable number of players;convexity;infinite sequencing situations

Dynamic Collusion and Collusion Games in Knaster's Procedure

3noIn this paper we study the collusion in Knaster’s procedure, starting from the paper of Fragnelli and Marina (2009). First, we introduce a suitable dynamic mechanism, so that the coalition enlargement is always non-disadvantageous. Then, we define a new class of TU-games in order to evaluate the collusion power of the agents.openopenBriata, Federica; Dall'Aglio, Marco; Fragnelli, VitoBriata, Federica; Dall'Aglio, Marco; Fragnelli, Vit

Sequencing Interval Situations and Related Games

In this paper we consider one-machine sequencing situations with interval data. We present different possible scenarioes and extend classical results on well known rules and on sequencing games to the interval setting.cooperative games;interval data;sequencing situations;convex games

On 1-convexity and nucleolus of co-insurance games

The situation, in which an enormous risk is insured by a number of insurance companies, is modeled through a cooperative TU game, the so-called co-insurance game, first introduced in Fragnelli and Marina (2004). In this paper we show that a co-insurance game possesses several interesting properties that allow to study the nonemptiness and the structure of the core and to construct an efficient algorithm for computing the nucleolus